Modeling and Encoding Automated Planning Problems with the P-stable Semantics
نویسندگان
چکیده
Our work is intended to model and solve artificial planning problems with logic based planning, using the novel semantics called p-stable, which is an alternative of stable semantics. Also we present a method to encode a general planning problem and then we present an example, which is the blocks world problem. This can be applied in a variety of tasks including robotics, process planning, updates, making evacuation plans and so on.
منابع مشابه
Logic Programs and Classical Planning with LTLConstraints
The paper deals with encoding planning problems with LTL constraints as disjunctive logic programs (LP ) and computing the plans (answer sets) under the stable model semantics. In order to encode the problem as a logic program, we use a well known SAT encoding of classical planning problems. Observing that obtaining the LP encoding for the LTL constraints results in an exponential blowup in the...
متن کاملDynamics modeling and stable gait planning of a quadruped robot in walking over uneven terrains
Quadruped robots have unique capabilities for motion over uneven natural environments. This article presents a stable gait for a quadruped robot in such motions and discusses the inverse-dynamics control scheme to follow the planned gait. First, an explicit dynamics model will be developed using a novel constraint elimination method for an 18-DOF quadruped robot. Thereafter, an inverse-dynamics...
متن کاملEncoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational ee-ciency as our major consideration. In order to accomplish our goal, we bring together ideas from logic programming and the planning systems graphplan and satplan. We discuss diierent representations of planning problems in logic programs, point out issues related to their pe...
متن کاملEncoding Planning
We present a framework for encoding planning problems in logic programs with negation as failure, having computational ee-ciency as our major consideration. In order to accomplish our goal, we bring together ideas from logic programming and the planning systems graphplan and satplan. We discuss diierent representations of planning problems in logic programs, point out issues related to their pe...
متن کاملTemporally-Expressive Planning as Constraint Satisfaction Problems
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at least two ways: it only considers temporally simple domains and it has restricted decision epochs as the potential happening time of actions. Because of these simplifying assumptions, existing temporal planners are in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011